A combinatorial proof of Bass's determinant formula for the zeta function of regular graphs
نویسنده
چکیده
We give an elementary combinatorial proof of Bass’s determinant formula for the zeta function of a finite regular graph. This is done by expressing the number of non-backtracking cycles of a given length in terms of Chebychev polynomials in the eigenvalues of the adjacency operator of the graph.
منابع مشابه
Several Proofs of Ihara's Theorem
We give three proofs that the reciprocal of Ihara's zeta function can be expressed as a simple polynomial times a determinant involving the adjacency matrix of the graph. The rst proof, for regular graphs, is based on representing radial symmetric eigenfunctions on regular trees in terms of certain polynomials. The second proof, also for regular graphs, is a consequence of the fact that the res...
متن کاملعدد تناوبی گراف‌ها
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem.
متن کاملZeta Functions and Chaos
This paper is an expanded version of lectures given at M.S.R.I. in June of 2008. It provides an introduction to various zeta functions emphasizing zeta functions of a finite graph and connections with random matrix theory and quantum chaos. Section 2. Three Zeta Functions For the number theorist, most zeta functions are multiplicative generating functions for something like primes (or prime ide...
متن کاملA Combinatorial Proof of a Formula of Biane and Chapuy
Abstract. Let G be a simple strongly connected weighted directed graph. Let G denote the spanning tree graph of G. That is, the vertices of G consist of the directed rooted spanning trees on G, and the edges of G consist of pairs of trees (ti, tj) such that tj can be obtained from ti by adding the edge from the root of ti to the root of tj and deleting the outgoing edge from the root of tj . A ...
متن کاملWeighted zeta functions of graphs
We define a weighted zeta function of a digraph and a weighted L-function of a symmetric digraph, and give determinant expressions of them. Furthermore, we give a decomposition formula for the weighted zeta function of a g-cyclic -cover of a symmetric digraph for any finite group and g ∈ . A decomposition formula for the weighted zeta function of an oriented line graph L(G̃) of a regular coverin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.00851 شماره
صفحات -
تاریخ انتشار 2017